Method and apparatus for singular value decomposition of a channel matrix

ABSTRACT

A method and apparatus for decomposing a channel matrix in a wireless communication system are disclosed. A channel matrix H is generated for channels between transmit antennas and receive antennas. A Hermitian matrix A=H H H or A=HH H  is created. A Jacobi process is cyclically performed on the matrix A to obtain Q and D A  matrixes such that A=QD A Q H . DA is a diagonal matrix obtained by singular value decomposition (SVD) on the A matrix. In each Jacobi transformation, real part diagonalization is performed to annihilate real parts of off-diagonal elements of the matrix and imaginary part diagonalization is performed to annihilate imaginary parts of off-diagonal elements of the matrix after the real part diagonalization. U, V and D H  matrixes of H matrix are then calculated from the Q and DA matrices. D H  is a diagonal matrix comprising singular values of the H matrix.

CROSS REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. application Ser. No. 11/392,025, filed Mar. 29, 2009, which claims the benefit of U.S. Provisional Application No. 60/667,326 filed Apr. 1, 2005, all of which are incorporated by reference as if fully set forth.

FIELD OF INVENTION

The present invention is related to a wireless communication system. More particularly, the present invention is related to a method and apparatus for singular value decomposition (SVD) of a channel matrix.

BACKGROUND

Orthogonal frequency division multiplexing (OFDM) is a data transmission scheme where data is split into a plurality of smaller streams and each stream is transmitted using a sub-carrier with a smaller bandwidth than the total available transmission bandwidth. The efficiency of OFDM depends on choosing these sub-carriers orthogonal to each other. The sub-carriers do not interfere with each other while each carrying a portion of the total user data.

An OFDM system has advantages over other wireless communication systems. When the user data is split into streams carried by different sub-carriers, the effective data rate on each sub-carrier is much smaller. Therefore, the symbol duration is much larger. A large symbol duration can tolerate larger delay spreads. Thus, it is not affected by multipath as severely. Therefore, OFDM symbols can tolerate delay spreads without complicated receiver designs. However, typical wireless systems need complex channel equalization schemes to combat multipath fading.

Another advantage of OFDM is that the generation of orthogonal sub-carriers at the transmitter and receiver can be done by using inverse fast Fourier transform (IFFT) and fast Fourier transform (FFT) engines. Since the IFFT and FFT implementations are well known, OFDM can be implemented easily and does not require complicated receivers.

Multiple-input multiple-output (MIMO) refers to a type of wireless transmission and reception scheme where both a transmitter and a receiver employ more than one antenna. A MIMO system takes advantage of the spatial diversity or spatial multiplexing and improves signal-to-noise ratio (SNR) and increases throughput.

Generally there are two modes of operation for MIMO systems: an open loop mode and a closed loop mode. The closed loop mode is used when channel state information (CSI) is available to the transmitter and the open loop is used when CSI is not available at the transmitter. In the closed loop mode, CSI is used to create virtually independent channels by decomposing and diagonalizing the channel matrix by preceding at the transmitter and further antenna processing at the receiver. The CSI can be obtained at the transmitter either by feedback from the receiver or through exploiting channel reciprocity.

A minimum mean square error (MMSE) receiver for open loop MIMO needs to compute weight vectors for data decoding and the convergence rate of the weight vectors is important. A direct matrix inversion (DMI) technique of correlation matrix converges more rapidly than a least mean square (LMS) or maximum SNR processes. However, the complexity of the DMI process increases exponentially as the matrix size increases. An eigen-beamforming receiver for the closed loop MIMO needs to perform SVD on the channel matrix. The complexity of the SVD processes also increases exponentially as the channel matrix size increases.

SUMMARY

The present invention is related to a method and apparatus for decomposing a channel matrix in a wireless communication system including a transmitter having a plurality of transmit antennas and a receiver having a plurality of receive antennas. A channel matrix H is generated for channels between the transmit antennas and the receive antennas. A Hermitian matrix A=H^(H)H or A=HH^(H) is created. A Jacobi process is cyclically performed on the matrix A to obtain Q and D_(A) matrices such that A=QD_(A)Q^(H), where D_(A) is a diagonal matrix obtained by SVD of the matrix A. In each Jacobi transformation, real part diagonalization is performed to annihilate real parts of off-diagonal elements of the matrix and imaginary part diagonalization is performed to annihilate imaginary parts of off-diagonal elements of the matrix after the real part diagonalization. U, V and D_(H) matrixes of H matrix, (D_(H) is a diagonal matrix comprising singular values of the matrix H), is then calculated from the Q and D_(A) matrices.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of an OFDM-MIMO system including a transmitter and a receiver implementing eigen beamforming using SVD in accordance with the present invention.

FIG. 2 is a flow diagram of a process for performing an SVD on the channel matrix H in accordance with the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The features of the present invention may be incorporated into an integrated circuit (IC) or be configured in a circuit comprising a multitude of interconnecting components.

The present invention provides means for channel estimation, direct inversion of channel correlation matrix in an MMSE receiver and SVD for an eigen beamforming receiver.

FIG. 1 is a simplified block diagram of an OFDM-MIMO system 10 including a transmitter 100 and a receiver 200 implementing eigen beamforming using SVD in accordance with the present invention. It should be noted that the system 10 shown in FIG. 1 is provided as an example, not as a limitation, and the present invention is applicable to any wireless communication system needing a matrix decomposition using SVD. The transmitter 100 includes a channel coder 102, a demultiplexer 104, a plurality of serial-to-parallel (S/P) converters 106, a transmit beamformer 108, a plurality of IFFT units 110, cyclic prefix (CP) insertion units 112 and a plurality of transmit antennas 114. The channel coder 102 encodes input data 101 and the encoded data stream 103 is parsed into N_(T) data streams 105 by the demultiplexer 104. NT is the number of transmit antennas 114. OFDM processing is performed on each data stream 105. Each data stream 105 is converted into multiple data streams 107 by the S/P converters 106. The data streams 107 are then processed by the transmit beamformer 108. The transmit beamformer 108 performs a transmit preceding with a V matrix decomposed from a channel matrix and sent by the receiver 200 as indicated by arrow 220, which will be explained in detail hereinafter. The IFFT units 110 convert the data into time-domain data streams 111 and a CP is inserted in each data stream 111 by each of the CP insertion units 112 and transmitted through respective ones of the transmit antennas 114.

The receiver 200 includes a plurality of receive antennas 202, CP removal units 204, FFT units 206, a receive beamformer 208, a multiplexer 210, a channel decoder 212, a channel estimator 214 and a matrix decomposition and channel correlation matrix unit 216. The CP is removed from received signals 203 by the CP removal units 204 and processed by the FFT units 206 to be converted to frequency-domain data streams 207. The receive beamformer 208 processes the frequency-domain data streams 207 with U and D matrices 217 decomposed from the channel matrix, which is generated by the matrix decomposition and channel correlation matrix unit 216. Each output 209 of the receive beamformer 208 is then multiplexed by the multiplexer 210 and decoded by the channel decoder 212, which generates a decoded data stream 218. The channel estimator 214 generates a channel matrix 215 preferably from training sequences transmitted by the transmitter 100 via each transmit antenna 114. The matrix decomposition and channel correlation matrix unit 216 decomposes the channel matrix into U, V and D matrices and sends the V matrix 220 to the transmitter 100 and sends the U and D matrices 217 to the receive beamformer 208, which will be explained in detail hereinafter.

The present invention reduces the complexity of both DMI and SVD processes using the characteristics of Hermitian matrix and imaginary part diagonalization. The present invention reduces the complexity significantly over the prior art and, for asymmetric matrices, provides a saving in terms of complexity that is much larger than is provided in the prior art.

The following definition will be used throughout the present invention.

Nt is the number of transmit antennas.

Nr is the number of receive antennas.

s(i) is the i-th (Nt×1) training vector of a subcarrier.

v(i) is the i-th (Nr×1) receive noise vector with v(i)˜Nc(0,1).

y(i) is the i-th (Nr×1) received training vector of a subcarrier.

H is the (Nr×Nt) MIMO channel matrix with h_(ij) representing the complex gain of the channel between the j-th transmit antenna and the i-th receive antenna.

The received signals corresponding to the training symbols are as follows:

$\begin{matrix} {{{y(i)} = {{\sqrt{\frac{\rho}{Nt}}{{Hs}(i)}} + {v(i)}}}{{i = 1},2,\ldots \mspace{14mu},{T;}}} & {{Equation}\mspace{14mu} (1)} \end{matrix}$

for T≧Nt MIMO training symbols. ρ is a total SNR which is independent from the number of transmit antennas.

By denoting Y=[y(1), y(2), . . . , y(T)], S=[s(1), s(2), . . . , s(T)} and V=[v(1), v(2), . . . , v(T)] for a subcarrier, Equation (1) can be rewritten as follows:

$\begin{matrix} {Y = {{\sqrt{\frac{\rho}{Nt}}{HS}} + {V.}}} & {{Equation}\mspace{14mu} (2)} \end{matrix}$

The maximum likelihood estimate of the channel matrix H for a subcarrier is given by:

$\begin{matrix} \begin{matrix} {H_{ML} = {\arg \mspace{14mu} {\min\limits_{H}\mspace{11mu} {\min {{Y - {\sqrt{\frac{\rho}{Nt}}{HS}}}}^{2}}}}} \\ {{= {\sqrt{\frac{Nt}{\rho}}{{YS}^{H}\left( {SS}^{H} \right)}^{- 1}}};} \end{matrix} & {{Equation}\mspace{14mu} (3)} \end{matrix}$

where the superscript H represents Hermitian transpose and S is a training symbol sequence. It is assumed that the transmitted training symbols are unitary power, E{|s_(i)|²=1.

As an alternative to the maximum likelihood channel estimate, linear minimum mean square error (MMSE) channel estimate is given by:

$\begin{matrix} {H_{MMSE} = {\sqrt{\frac{\rho}{Nt}}{{{YS}^{H}\left( {{\frac{\rho}{Nt}{SS}^{H}} + I} \right)}^{- 1}.}}} & {{Equation}\mspace{14mu} (4)} \end{matrix}$

Since S is known, SSH can be computed offline. If the training symbol sequence S satisfies SS^(H)=T·I_(Nt) where I_(Nt) is the Nt×Nt identity matrix, the training symbol sequence S is optimal. For example, according to the HT-LTF pattern for 4 antennas in IEEE 802.11 specification, the training symbol sequence for the subcarrier number (−26),

$\begin{matrix} \begin{matrix} {S_{- 26} = {{\begin{matrix} 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 \\ 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 \\ 0 & 0 & 1 & 1 & 0 & 0 & 0 & 0 \end{matrix}}\mspace{14mu} {is}\mspace{14mu} {optimal}\mspace{14mu} {since}\mspace{14mu} S_{- 26}S_{- 26}^{H}}} \\ {= {2{{\begin{matrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{matrix}}.}}} \end{matrix} & \; \end{matrix}$

The input-output relationship of a MIMO system can be expressed as follows:

$\begin{matrix} {{y = {{\sqrt{\frac{\rho}{Nt}}{Hs}} + v}};} & {{Equation}\mspace{14mu} (5)} \end{matrix}$

where s=[s₁, s₂, . . . , s_(Nt)]^(T) is the Nt×1 transmit signal vector with s_(i) belonging to a finite constellation, v=[v₁, v₂, . . . , v_(Nr)]^(T) is the Nr×1 receive white Gaussian noise vector. H is the Nt×Nr MIMO channel matrix with h_(ij) representing the complex gain of the channel between the j-th transmit antenna and the i-th receive antenna. Then the data decoding process based on the MMSE is given by:

$\begin{matrix} {s = {{\left( {{\frac{\rho}{Nt}H^{H}H} + I} \right)^{- 1}H^{H}y} = {{R^{- 1}H^{H}y} = {w^{H}{y.}}}}} & {{Equation}\mspace{14mu} (6)} \end{matrix}$

A matrix inversion process for a 2×2 matrix is explained hereinafter.

Direct computation for inverse of 2×2 Hermitian matrix R.

A Hermitian matrix R in Equation (6) and its inverse matrix T are defined as

$R = {{{\begin{matrix} R_{11} & R_{12} \\ R_{21} & R_{22} \end{matrix}}\mspace{14mu} {and}\mspace{14mu} T} = {R^{- 1} = {{\begin{matrix} T_{11} & T_{12} \\ T_{21} & T_{22} \end{matrix}}.}}}$

The diagonal elements (R₁₁ and R₂₂) of the Hermitian matrix R are real and its off-diagonal elements (R₁₂ and R₂₁) are conjugate symmetric. The inverse matrix T is also Hermitian. Since RT=I where I is a 2×2 identity matrix, the inverse matrix T is obtained by expanding the left-hand side and equating the respective terms with I as follows:

$\begin{matrix} {{T_{11} = \frac{R_{22}}{{R_{11}R_{22}} - {R_{12}R_{12}^{H}}}},\mspace{14mu} {T_{12} = {- \frac{R_{12}T_{11}}{R_{22}}}},\mspace{14mu} {T_{21} = T_{12}^{H}},{T_{22} = {\frac{1 - {R_{21}T_{12}}}{R_{22}}.}}} & {{Equation}\mspace{14mu} (7)} \end{matrix}$

Computing the inverse of 2×2 Hermitian matrix R using Eigenvalue Decomposition.

A Hermitian matrix R in Equation (6) is defined as follows: R=QDQ^(H) where Q is unitary and D is diagonal.

${R = {\begin{matrix} R_{11} & R_{12} \\ R_{21} & R_{22} \end{matrix}}},\mspace{14mu} {Q = {\begin{matrix} Q_{11} & Q_{12} \\ Q_{21} & Q_{22} \end{matrix}}},\mspace{14mu} {D = {\begin{matrix} D_{11} & 0 \\ 0 & D_{22} \end{matrix}}},$

where D₁₁ and D₂₂ are eigenvalues of R.

The eigenvalues D₁₁ and D₂₂ are computed as follows:

$\begin{matrix} {{D_{11} = \frac{\left( {R_{11} + R_{12}} \right) + \sqrt{\begin{matrix} {\left( {R_{11} + R_{22}} \right)^{2} -} \\ {4\left( {R_{11} + R_{22} - {R_{12}R_{12}^{*}}} \right)} \end{matrix}}}{2}};} & {{Equation}\mspace{14mu} (8)} \\ {D_{22} = {\frac{\left( {R_{11} + R_{22}} \right) - \sqrt{\begin{matrix} {\left( {R_{11} + R_{22}} \right)^{2} -} \\ {4\left( {R_{11} + R_{22} - {R_{12}R_{12}^{*}}} \right)} \end{matrix}}}{2}.}} & {{Equation}\mspace{14mu} (9)} \end{matrix}$

From RQ=QD, expanding the left-hand and the right-hand sides and equating the respective terms, the following equations are obtained:

R ₁₁ Q ₁₁ +R ₁₂ Q ₂₁ =Q ₁₁ D ₁₁;  Equation (10)

R ₁₁ Q2+R ₁₂ Q ₂₂ =Q ₁₂ D ₂₂;  Equation (11)

R ₁₂ ^(H) Q ₁₁ +R ₂₂ Q ₂₁ =Q ₂₁ D ₁₁;  Equation (12)

R ₁₂ ^(H) Q ₁₂ +R ₂₂ Q ₂₂ =Q ₂₂ D ₂₂.  Equation (13)

From Q^(H)Q=I where I is the 2×2 identity matrix, expanding the left-hand and the right-hand sides and equating the respective terms, the following equations are obtained:

Q ₁₁ ^(H) Q ₁₁ +Q ₂₁ ^(H) Q ₂₁=1;  Equation (14)

Q ₁₁ ^(H) Q ₁₂ +Q ₂₁ ^(H) Q ₂₂=0;  Equation (15)

Q ₁₁ ^(H) Q ₁₁ +Q ₂₂ ^(H) Q ₂₁=0;  Equation (16)

Q ₁₂ ^(H) Q ₁₂ +Q ₂₂ ^(H) Q ₂₂=1.  Equation (17)

From Equation (10),

$\begin{matrix} {Q_{21} = {\frac{\left( {D_{11} - R_{11}} \right)Q_{11}}{R_{12}}.}} & {{Equation}\mspace{14mu} (18)} \end{matrix}$

Substituting Equation (18) to Equation (14),

$\begin{matrix} {Q_{11} = {\sqrt{\frac{R_{12}^{H}R_{12}}{{R_{12}^{H}R_{12}} + \left( {D_{11} - R_{11}} \right)^{2}}}.}} & {{Equation}\mspace{14mu} (19)} \end{matrix}$

Substituting Equation (19) to Equation (18), Q₂₁ is obtained. From Equation (13),

$\begin{matrix} {Q_{22} = {\frac{R_{12}^{H}Q_{12}}{D_{22} - R_{22}}.}} & {{Equation}\mspace{14mu} (20)} \end{matrix}$

Substituting Equation (20) to Equation (17),

$\begin{matrix} {Q_{12} = {\sqrt{\frac{\left( {D_{22} - R_{22}} \right)^{2}}{{R_{12}^{H}R_{12}} + \left( {D_{22} - R_{22}} \right)^{2}}}.}} & {{Equation}\mspace{14mu} (21)} \end{matrix}$

Substituting Equation (21) to Equation (20), Q₂₂ is obtained. Then the inverse matrix is obtained by:

R⁻¹=QD⁻¹Q^(H).  Equation (22)

Eigen beamforming receiver using SVD, which is shown in FIG. 1, is explained hereinafter. For the eigen beamforming receiver, the channel matrix H for a sub-carrier is decomposed into two beam-forming unitary matrices, U for transmit and V for receive, and a diagonal matrix D by SVD.

H=UDV^(H);  Equation (23)

where U and V are unitary matrices and D is a diagonal matrix. UεC^(nRxnR) and VεC^(nTxnT). For transmit symbol vector s, the transmit preceding is performed as follows:

x=Vs  Equation (24)

The received signal becomes as follows:

y=HVs+n;  Equation (25)

where n is the noise introduced in the channel. The receiver completes the decomposition by using a matched filter as follows:

V^(H)H^(H)=V^(H)VD^(H)U^(H)=D^(H)U^(H)  Equation (26)

After normalizing for channel gain for eigenbeams, the estimate of the transmit symbols s becomes as follws:

$\begin{matrix} {\hat{s} = {{\alpha \; D^{H}U^{H}y}\mspace{11mu} = {{\alpha \; D^{H}{U^{H}\left( {{HVs} + n} \right)}}\mspace{11mu} = {{\alpha \; D^{H}{U^{H}\left( {{{UDV}^{H}{Vs}} + n} \right)}}\mspace{11mu} = {s + {\alpha \; D^{H}U^{H}{n.}}}}}}} & {{Equation}\mspace{14mu} (27)} \end{matrix}$

s is detected without having to perform successive interference cancellation of MMSE type detector. D^(H)D is a diagonal matrix that is formed by eigenvalues of H across the diagonal. Therefore, the normalization factor α=D⁻². U is a matrix of eigenvectors of HH^(H), V is a matrix of eigenvectors of H^(H)H and D is a diagonal matrix of singular values of H (square roots of eigenvalues of HH^(H)).

An SVD process for N×M channel matrix for N>2 and M>2.

The following SVD computation, (Equations (28) through (52)), is based upon cyclic Jacobi process using Givens rotation. The two-sided Jacobi process is explained hereinafter.

Step 1: complex data is converted to real data.

A 2×2 complex matrix is given as follows:

$\begin{matrix} {A = {{\begin{matrix} a_{ii} & a_{ij} \\ a_{ji} & a_{jj} \end{matrix}}.}} & {{Equation}\mspace{14mu} (28)} \end{matrix}$

Step 1-1: a_(ii) is converted to a positive real number b₁₁ as follows:

If (a₁₁ is equal to zero) then

$\begin{matrix} {{{B = {{\begin{matrix} b_{11} & b_{12} \\ b_{21} & b_{22} \end{matrix}} = A}};}{else}} & {{Equation}\mspace{14mu} (29)} \\ {{{B = {{\begin{matrix} b_{11} & b_{12} \\ b_{21} & b_{22} \end{matrix}} = {{kA} = {k{\begin{matrix} a_{ii} & a_{ij} \\ a_{ji} & a_{jj} \end{matrix}}}}}};}{where}\mspace{14mu} k = {{\frac{a_{11}^{*}}{a_{11}}\mspace{14mu} {and}\mspace{14mu} {a_{11}}} = {\sqrt{{{real}\left( a_{11} \right)}^{2} + {{imag}\left( a_{11} \right)}^{2}}.}}} & {{Equation}\mspace{14mu} (30)} \end{matrix}$

Step 1-2: Triangularization. The matrix B is then converted to a triangular matrix W by multiplying a transformation matrix CSTriangle as follows:

If (a_(ij) or a_(ji) is equal to zero and a_(jj) is equal to zero) then

$\begin{matrix} {{CSTriangle} = {{\begin{matrix} c & s^{*} \\ {- s} & c \end{matrix}} = {{{{\begin{matrix} 1 & 0 \\ 0 & 1 \end{matrix}}\mspace{14mu} {where}\mspace{14mu} c^{2}} + s^{2}} = 1.}}} & {{Equation}\mspace{14mu} (31)} \\ {{{W = {{({CSTriangle})(B)} = B}};}{else}} & {{Equation}\mspace{14mu} (32)} \\ {{W = {{({CSTriangle})(B)}\mspace{25mu} = {{{\begin{matrix} c & s^{*} \\ {- s} & c \end{matrix}}{\begin{matrix} b_{ii} & b_{ij} \\ b_{ji} & b_{jj} \end{matrix}}}\mspace{25mu} = {\begin{matrix} w_{ii} & w_{ij} \\ 0 & w_{jj} \end{matrix}}}}};} & {{Equation}\mspace{14mu} (33)} \end{matrix}$

-   -   where the cosine parameter c is real, s is complex and         c²=|s|²=1Then

$\begin{matrix} {c = {{\frac{b_{ii}}{\sqrt{{b_{ii}}^{2} + {b_{ji}}^{2}}}\mspace{14mu} {and}\mspace{14mu} s} = {\frac{b_{ji}}{b_{ii}}{c.}}}} & {{Equation}\mspace{14mu} (34)} \end{matrix}$

Step 1-3: Phase cancellation. To convert the elements of the triangular matrix W to real numbers, transformation matrices prePhC and postPhC are multiplied to the matrix Was follows:

If (a_(ij) and a_(jj) are equal to zero and a_(ji) is not equal to zero) then

$\begin{matrix} {{{realW} = {{({prePhC})(W)({postPhC})}\mspace{65mu} = {{{\begin{matrix} ^{- {j\gamma}} & 0 \\ 0 & ^{- {j\beta}} \end{matrix}}{\begin{matrix} w_{ii} & 0 \\ w_{ji} & 0 \end{matrix}}{\begin{matrix} 1 & 0 \\ 0 & ^{j\beta} \end{matrix}}}\mspace{65mu} = {\begin{matrix} w_{ii} & 0 \\ {w_{ji}} & 0 \end{matrix}}}}};} & {{Equation}\mspace{14mu} (35)} \\ {{{{where}\mspace{14mu} \beta} = {{{\arg\left( w_{ji} \right)}\mspace{14mu} {and}\mspace{14mu} \gamma} = {\arg \left( w_{ii} \right)}}},\mspace{14mu} {i.e.},{^{- {j\beta}} = \frac{w_{ji}^{*}}{w_{ji}}},{{{{and}\mspace{14mu} ^{- {j\gamma}}} = \frac{w_{ii}^{*}}{w_{ii}}};}} & {{Equation}\mspace{14mu} (36)} \end{matrix}$

else if (a_(ij) is not equal to zero) then

$\begin{matrix} {{{{{realW} = {{({prePhC})(W)({postPhC})}\mspace{65mu} = {{{\begin{matrix} ^{- {j\beta}} & 0 \\ 0 & ^{- {j\gamma}} \end{matrix}}{\begin{matrix} w_{ii} & w_{ij} \\ 0 & w_{jj} \end{matrix}}{\begin{matrix} ^{j\beta} & 0 \\ 0 & 1 \end{matrix}}}\mspace{65mu} = {\begin{matrix} w_{ii} & {w_{ij}} \\ 0 & {w_{jj}} \end{matrix}}}}};}{{where}\mspace{14mu} \beta} = {{{\arg \left( w_{ij} \right)}\mspace{14mu} {and}\mspace{14mu} \gamma} = {\arg \left( w_{jj} \right)}}},\; {i.e.},{^{- {j\beta}} = \frac{w_{ij}^{*}}{w_{ij}}},} & {{Equation}\mspace{14mu} (37)} \end{matrix}$

and

-   -   If (a_(jj) is equal to zero)

$\begin{matrix} {{{^{- {j\gamma}} = 1};}{else}} & {{Equation}\mspace{14mu} (38)} \\ {{{^{- {j\gamma}} = \frac{w_{jj}^{*}}{w_{jj}}};}{else}} & {{Equation}\mspace{14mu} (39)} \\ \begin{matrix} {{realW} = {({prePhC})(W)({postPhC})}} \\ {= {{\begin{matrix} 1 & 0 \\ 0 & 1 \end{matrix}}{\begin{matrix} w_{ii} & w_{ij} \\ 0 & w_{jj} \end{matrix}}{\begin{matrix} 1 & 0 \\ 0 & 1 \end{matrix}}}} \\ {= {W.}} \end{matrix} & {{Equation}\mspace{14mu} (40)} \end{matrix}$

Step 2: Symmetrization—a symmetrizing rotation is applied if the matrix realW is not a symmetric matrix. If the matrix realW is symmetric, this step is skipped.

If (a_(ji) is equal to zero and a_(jj) is equal to zero) then

$\begin{matrix} {{{{symW} = {{({symM})^{T}({realW})}\mspace{65mu} = {{{\begin{matrix} 1 & 0 \\ 0 & 1 \end{matrix}}{realW}}\mspace{65mu} = {realW}}}};}{else}} & {{Equation}\mspace{14mu} (41)} \\ {{{{symW} = {{({symM})^{T}({realW})}\mspace{65mu} = {{{\begin{matrix} c & s \\ {- s} & c \end{matrix}}^{T}\begin{bmatrix} r_{ii} & r_{ij} \\ r_{ji} & r_{jj} \end{bmatrix}}\mspace{65mu} = {\begin{matrix} s_{ii} & s_{ij} \\ s_{ji} & s_{jj} \end{matrix}}}}};}{where}{s_{ji} = {{{s_{ij}\mspace{14mu} {and}\mspace{14mu} c^{2}} + s^{2}} = 1.}}} & {{Equation}\mspace{14mu} (42)} \end{matrix}$

By expanding the left-hand side and equating terms,

$\begin{matrix} {{\rho = {\frac{r_{11} + r_{jj}}{r_{ij} - r_{ji}} = \frac{c}{s}}},\mspace{14mu} {s = \frac{{sign}\; (\rho)}{\sqrt{1 + \rho^{2}}}},\mspace{14mu} {c = {\rho \; {s.}}}} & {{{Equation}\mspace{14mu} (43)}\;} \end{matrix}$

Step 3: Diagonalization—a diagonalizing rotation is applied to annihilate off-diagonal elements in the matrix symW (or realW).

If (a_(ij) is equal to zero and a_(jj) is equal to zero) then

$\begin{matrix} {{{D = {{\left( {{diag}M} \right)^{T}({symW})\left( {{diag}M} \right)} = {\begin{matrix} d_{ii} & 0 \\ 0 & d_{jj} \end{matrix}}}},{{{{where}\mspace{14mu} {{diag}M}} = {\begin{matrix} 1 & 0 \\ 0 & 1 \end{matrix}}};}}{else}} & {{Equation}\mspace{14mu} (44)} \\ {{{D = {{\left( {{diag}M} \right)^{T}({symW})\left( {{diag}M} \right)} = {{{\begin{matrix} c & s \\ {- s} & c \end{matrix}}^{T}{\begin{matrix} s_{ii} & s_{ij} \\ s_{ji} & s_{jj} \end{matrix}}{\begin{matrix} c & s \\ {- s} & c \end{matrix}}} = {\begin{matrix} d_{ii} & 0 \\ 0 & d_{jj} \end{matrix}}}}};}{{{{where}\mspace{14mu} c^{2}} + s^{2}} = 1.}} & {{Equation}\mspace{14mu} (45)} \end{matrix}$

By expanding the left-hand side and equating the respective off-diagonal terms,

$\begin{matrix} {{\zeta = \frac{s_{jj} - s_{ii}}{2s_{ji}}},\mspace{14mu} {t = {{{\frac{s}{c}\mspace{14mu} {where}\mspace{14mu} t^{2}} + {2\; \zeta \; t} - 1} = 0.}}} & {{Equation}\mspace{14mu} (46)} \end{matrix}$

$\begin{matrix} {\; {{t = {\frac{s}{c} = \frac{{sign}(\zeta)}{{\zeta } + \sqrt{1 + \zeta^{2}}}}},\mspace{14mu} {or}}} & {{Equation}\mspace{14mu} (47)} \end{matrix}$

For inner rotation,

$\begin{matrix} {t = {\frac{s}{c} = {{- {sign}}\; (\zeta)\left( {{\zeta } + {\sqrt{1 + \zeta^{2}}.}} \right.}}} & {{Equation}\mspace{14mu} (48)} \end{matrix}$

For outer rotation,

Then

$\begin{matrix} {c = {{\frac{1}{\sqrt{1 + t^{2}}}\mspace{14mu} {and}\mspace{14mu} s} = {{tc}.}}} & {{Equation}\mspace{14mu} (49)} \end{matrix}$

Step 4: Fusion of rotation matrices to generate U and V matrices. U and V matrices are obtained as follows:

A=UDV^(H).  Equation (50)

U=[k(diagM)^(H)(symM)^(H)(prePhC)(CSTrianlgle)]^(H).  Equation (51)

V=(postPhC)(diagM).  Equation (52)

Cyclic generalized Jacobi process for an M×M square matrix.

In order to annihilate the off-diagonal elements, (i.e., (i,j) and (j,i) elements), of A, the procedures described hereinabove are applied to the M×M matrix A for a total of m=M(M−1)/2 different index pairs in some fixed order. Such a sequence of m transformation is called a sweep. The construction of a sweep may be cyclic by rows or cyclic by columns. In either case, a new matrix A is obtained after each sweep, for which

${{off}(A)} = {\sum\limits_{i = 1}^{M}{\sum\limits_{j = 1}^{M}a_{ij}^{2}}}$

for j≠i is computed. If off(A)≦δ, the computation stops. δ is a small number dependent on computational accuracy. Otherwise, the computation is repeated.

Cyclic generalized Jacobi process for an N×M rectangular matrix.

If the dimension N of matrix A is greater than M, a square matrix is generated by appending (N−M) columns of zeros to A. The augmented square matrix B=|A 0|. Then the procedures described hereinabove are applied to B.

$\begin{matrix} {{U^{T}{{A\mspace{14mu} 0}}{\begin{matrix} V & 0 \\ 0 & I \end{matrix}}} = {{{diag}\left( {\lambda_{1},\lambda_{2},\ldots \mspace{14mu},\lambda_{M},0,{\ldots \mspace{14mu} 0}} \right)}.}} & {{Equation}\mspace{14mu} (53)} \end{matrix}$

The desired factorization of the original data matrix A is obtained by:

U^(T)AV=diag(λ₁, λ₂, . . . , λ_(M)).  Equation (54)

If the dimension M of matrix A is greater than N, a square matrix is generated by adding (M−N) rows of zeros to A as follows:

$\begin{matrix} {B = {{\begin{matrix} A \\ 0 \end{matrix}}.}} & {{Equation}\mspace{14mu} (55)} \end{matrix}$

Then the procedures described hereinabove are applied to B.

$\begin{matrix} {{{\begin{matrix} U & 0 \\ 0 & I \end{matrix}}^{T}{\begin{matrix} A \\ 0 \end{matrix}}V} = {{{diag}\left( {\lambda_{1},\lambda_{2},\ldots \mspace{14mu},\lambda_{N},0,{\ldots \mspace{14mu} 0}} \right)}.}} & {{Equation}\mspace{14mu} (56)} \end{matrix}$

The desired factorization of the original data matrix A is obtained by:

U^(T)AV=diag(λ₁, λ₂, . . . , λ_(N)).  Equation (57)

Hereinafter, the SVD process in accordance with the present invention is explained with reference to FIG. 2. FIG. 2 is a flow diagram of a process for SVD in accordance with the present invention. The present invention provides a method for performing a SVD process. A channel matrix H is created between a plurality of transmit antennas and a plurality of receive antennas (step 202). For the obtained Nr×Nt channel matrix H, a Hermitian matrix A is created (step 204). The matrix A is created as A=H^(H)H for Nr≧Nt and as A=HH^(H) for Nr<Nt. The two-sided Jacobi process is then cyclically applied to the M×M matrix A to obtain Q and D_(A) matrices such that A=QD_(A)Q^(H) where M=min(Nr,Nt), which will be explained hereinafter (step 206). D_(A) is a diagonal matrix obtained by SVD of the matrix A comprising eigenvalues of the matrix H. Since the matrix A is Hermitian and symmetric, the steps of the prior art for symmetrization is no longer required and the process is greatly simplified. Once SVD of A is computed, the U matrix, the V matrix and the D_(H) matrix of the H matrix, (H=UD_(H)V^(H)), is calculated from the Q matrix and the D_(A) matrix (step 208).

The step 206 for performing SVD on the A matrix is explained hereinafter. A 2×2 Hermitian matrix symW is defined from the matrix A as follows:

$\begin{matrix} {{{symW} = {{\begin{matrix} s_{ii} & s_{ij} \\ s_{ji} & s_{jj} \end{matrix}} = {\begin{matrix} a_{ii} & {a_{ij} + {j\; b_{ij}}} \\ {a_{ji} - {j\; b}} & a_{jj} \end{matrix}}}};} & {{Equation}\mspace{14mu} (58)} \end{matrix}$

where a_(ii), a_(ij), a_(ji), a_(jj), b_(ij) and b_(ji) are real numbers and a_(ij)=a_(ji) and b_(ij)=b_(ji). The matrix symW is generated from the matrix A for each Jacobi transformation as in the prior art mathod.

Real part diagonalization is performed on the matrix symW. Real parts of off-diagonal elements of the matrix symW are annihilated by multiplying transformation matrices (diagRM)^(T) and diagRM to the matrix symW as follows:

$\begin{matrix} {{D_{real} = {{\left( {{diag}{RM}} \right)^{T}({symW})\left( {{diag}{RM}} \right)}\mspace{50mu} = {{{\begin{matrix} c & s \\ {- s} & c \end{matrix}}^{T}{\begin{matrix} s_{ii} & s_{ij} \\ s_{ji} & s_{jj} \end{matrix}}{\begin{matrix} c & s \\ {- s} & c \end{matrix}}}\mspace{50mu} = {\begin{matrix} r_{ii} & {j\; b_{ij}} \\ {{- j}\; b_{ji}} & r_{jj} \end{matrix}}}}};} & {{Equation}\mspace{14mu} (59)} \end{matrix}$

where r_(ii) and r_(jj) are real numbers, b_(ij)=b_(ji) and c²+s²=1.

By expanding the left-hand side and equating the respective off-diagonal real terms, following equations are obtained.

$\begin{matrix} {{\zeta = {{\frac{a_{{jj}\;} - a_{ii}}{2a_{ji}}\mspace{14mu} {and}\mspace{14mu} t} = \frac{s}{c}}};} & {{Equation}\mspace{14mu} (60)} \end{matrix}$

where t²+2ζt−1=0.

For inner rotation,

$\begin{matrix} {{t = {\frac{s}{c} = \frac{{sign}\; (\zeta)}{{\zeta } + \sqrt{1 + \zeta^{2}}}}};\mspace{14mu} {or}} & {{Equation}\mspace{14mu} (61)} \end{matrix}$

For outer rotation,

$\begin{matrix} {t = {\frac{s}{c} = {{- {sign}}\mspace{14mu} (\zeta)\left( {{\zeta } + {\sqrt{1 + \zeta^{2}}.}} \right.}}} & {{Equation}\mspace{14mu} (62)} \end{matrix}$

Then,

$\begin{matrix} {c = {{\frac{1}{\sqrt{1 + t^{2}}}\mspace{14mu} {and}\mspace{14mu} s} = {{tc}.}}} & {{Equation}\mspace{14mu} (63)} \end{matrix}$

Imaginary part diagonalization is then performed. Imaginary parts of off-diagonal elements are annihilated by multiplying transformation matrices (diagIM)^(T) and diagIM to the matrix obtained by real part diagonalization as follows:

$\begin{matrix} {{D_{A} = {{({diagIM})^{T}\left( D_{real} \right)({diagIM})}\mspace{34mu} = {{{\begin{matrix} c & s \\ {{- j}\; s} & {j\; c} \end{matrix}}^{T}{\begin{matrix} r_{ii} & {j\; b_{ij}} \\ {{- j}\; b_{ji}} & r_{jj} \end{matrix}}{\begin{matrix} c & s \\ {{- j}\; s} & {j\; c} \end{matrix}}}\mspace{34mu} = {\begin{matrix} d_{ii} & 0 \\ 0 & d_{jj} \end{matrix}}}}};} & \left( {{Equation}\mspace{14mu} (64)} \right. \end{matrix}$

where c, s, r_(ii), r_(jj), b_(ij), b_(ji), d_(ii), and d_(jj) are real numbers, b_(ij)=b_(ji), and c²+s²=1.

By expanding the left-hand side and equating the respective off-diagonal terms, the following equations are obtained.

$\begin{matrix} {{k = {{4b_{ij}^{2}} + \left( {r_{ii} - r_{jj}} \right)^{2}}};} & {{Equation}\mspace{14mu} (65)} \\ {{x = {0.5\left( {1 + \sqrt{1 - \frac{4b_{ij}^{2}}{k}}} \right)}};} & {{Equation}\mspace{14mu} (66)} \\ {{c = {{\sqrt{1 - x}\mspace{14mu} {and}\mspace{14mu} s} = \sqrt{x}}};} & {{Equation}\mspace{14mu} (67)} \\ {y = {{{cs}\left( {r_{ii} - r_{jj}} \right)} + {\left( {1 - {2c^{2}}} \right){b_{ij}.}}}} & {{Equation}\mspace{14mu} (68)} \end{matrix}$

If y>threshold (e.g., =0.0001), then

$\begin{matrix} {{x = {0.5\left( {1 - \sqrt{1 - \frac{4b_{ij}^{2}}{k}}} \right)}};} & {{Equation}\mspace{14mu} (69)} \\ {c = {{\sqrt{1 - x}\mspace{14mu} {and}\mspace{14mu} s} = {\sqrt{x}.}}} & {{Equation}\mspace{14mu} (70)} \end{matrix}$

The threshold is some small machine dependant number.

The transformation matrices for the real part diagonalization and the imaginary part diagonalization are then combined to calculate U and V matrices as follows:

A=UD_(A)V^(H);  Equation (71)

U=[(diagIM)^(H)(diagRM)^(H)]^(H);  Equation (72)

V=(diagRM)(diagIM).  Equation (73)

In order to annihilate the off-diagonal elements, (i.e., (i,j) and (j,i) elements), of A, the foregoing procedures are applied to the M×M matrix A where M=min(Nr, Nt) for a total of m=M(M−1)/2 different index pairs in some fixed order. A new matrix A is obtained after each step, for which

${{off}(A)} = {\sum\limits_{i = 1}^{M}{\sum\limits_{j = 1}^{M}a_{ij}^{2}}}$

for j≠i is computed. If off(A)≦δ, where δ is some small machine dependent number, the computation stops. Otherwise, the computation is repeated.

Once the SVD of the matrix A is completed, the U matrix, the V matrix and the D_(H) matrix of the H matrix are calculated from the Q matrix and the D_(A) matrix at step 208 as follows:

From Equations (72) and (73), U=V and A matrix can be written as: A=QD_(A)Q^(H). When Nr≧Nt, since Q is equal to V, for H=UD_(H)V^(H) and D_(A)=Q^(H) AQ=Q^(H)H^(H)HQ=Q^(H)VD_(H)U^(H)UD_(H)V^(H)Q=D_(H)U^(H)UD_(H)=D_(H)D_(H), the D_(A)=D_(H)D_(H), (i.e., D_(H)=sqrt(D_(A))). Then, U, V and D_(H) matrices are obtained as follows: U=HV(D_(H))⁻¹ where V=Q and DH=sqrt(D_(A)).

When Nt>Nr, since Q is equal to U, for H=UD_(H)V^(H) and D_(A)=Q^(H) AQ=Q^(H)HH^(H)Q=Q^(H)UD_(H)V^(H)VD_(H)U^(H)Q=D_(H)V^(H)VD_(H)=D_(H)D_(H), D_(A)=D_(H)D_(H), (i.e., D_(H)=sqrt(D_(A))). Then, U, V and D_(H) matrices are obtained as follows: V=H^(H)U(D_(H))⁻¹ where U=Q and D_(H)=sqrt(D_(A)).

Although the features and elements of the present invention are described in the preferred embodiments in particular combinations, each feature or element can be used alone without the other features and elements of the preferred embodiments or in various combinations with or without other features and elements of the present invention. 

1. A method for performing singular value decomposition (SVD) of a channel matrix H such that H=UD_(H)V^(H), the method comprising: generating a channel matrix H; generating a correlation matrix A of the channel matrix; cyclically performing at least one sweep of a Jacobi process on the correlation matrix A to obtain Q and D_(A) matrices such that A=QD_(A)Q^(H), D_(A) being a diagonal matrix comprising eigenvalues of the correlation matrix A; and, calculating a U matrix, a V matrix and a D_(H) matrix from the Q matrix and the D_(A) matrix.
 2. The method of claim 1 wherein cyclically performing step comprises: selecting a 2×2 matrix ${symW} = {\begin{matrix} a_{ii} & a_{ij} \\ a_{ji} & a_{jj} \end{matrix}}$  from the correlation matrix A for Jacobi transformation; performing real part diagonalization to annihilate real parts of off-diagonal elements of the matrix symW; performing imaginary part diagonalization to annihilate imaginary parts of off-diagonal elements of the matrix symW after the real part diagonalization to generate a diagonal matrix D_(A); and, combining transformation matrices for the real part diagonalization and imaginary part diagonalization to calculate the Q matrix.
 3. The method of claim 2 further comprising: at each sweep of the Jacobi process, calculating a square sum of off-diagonal elements of a matrix obtained at each sweep of the Jacobi process; comparing the square sum with a threshold; and, repeating the steps of claim 2 only if the square sum is greater than the threshold.
 4. The method of claim 3 wherein the threshold is a machine dependent small number.
 5. An apparatus for performing singular value decomposition (SVD) of a channel matrix H such that H=UD_(H)V^(H), the apparatus comprising: a channel estimator for generating a channel matrix H; and, a matrix decomposition unit for generating a correlation matrix A of the channel matrix, cyclically performing at least one sweep of a Jacobi process on the correlation matrix A to obtain Q and D_(A) matrices such that A=QD_(A)Q^(H), D_(A) being a diagonal matrix comprising eigenvalues of the correlation matrix A and calculating a U matrix, a V matrix and a D_(H) matrix from the Q matrix and the D_(A) matrix.
 6. The apparatus of claim 5 wherein the matrix decomposition unit is configured to select a 2×2 matrix ${symW} = {\begin{matrix} a_{ii} & a_{ij} \\ a_{ji} & a_{jj} \end{matrix}}$ from the correlation matrix A for Jacobi transformation, perform real part diagonalization to annihilate real parts of off-diagonal elements of the matrix symW, perform imaginary part diagonalization to annihilate imaginary parts of off-diagonal elements of the matrix symW after the real part diagonalization to generate a diagonal matrix D_(A), and combine transformation matrices for the real part diagonalization and imaginary part diagonalization to calculate the Q matrix.
 7. The apparatus of claim 6 wherein the matrix decomposition unit is configured to calculate, at each sweep of the Jacobi process, a square sum of off-diagonal elements of a matrix obtained at each sweep of the Jacobi process, compare the square sum with a threshold, and repeat a processing for a new matrix symW only if the square sum is greater than the threshold.
 8. The apparatus of claim 7 wherein the threshold is a machine dependent small number.
 9. A wireless transmit/receive unit (WTRU) comprising the apparatus of claim
 6. 10. A base station comprising the apparatus of claim
 6. 11. A method for generating an inverse of a channel correlation matrix R of a 2×2 channel matrix H, the method comprising: generating a channel matrix H; generating a channel correlation matrix $R = {\begin{matrix} R_{11} & R_{12} \\ R_{21} & R_{22} \end{matrix}}$  from the channel matrix H; and, generating an inverse of the channel correlation matrix $T = {R^{- 1} = {\begin{matrix} T_{11} & T_{12} \\ T_{21} & T_{22} \end{matrix}}}$  as follows: ${T_{11} = \frac{R_{22}}{{R_{11}R_{22}} - {R_{12}R_{12}^{H}}}},\mspace{14mu} {T_{12} = {- \frac{R_{12}T_{11}}{R_{22}}}},{T = T_{12}^{H}},{T_{22} = {\frac{1 - {R_{21}T_{12}}}{R_{22}}.}}$
 12. A method for generating an inverse of a channel correlation matrix R of a 2×2 channel matrix H, the method comprising: generating a channel matrix H; generating a channel correlation matrix $R = {\begin{matrix} R_{11} & R_{12} \\ R_{21} & R_{22} \end{matrix}}$  of the channel matrix H; performing an eigenvalue decomposition of the channel correlation matrix R such that R=QDQ^(H), ${Q = {\begin{matrix} Q_{11} & Q_{12} \\ Q_{21} & Q_{22} \end{matrix}}},\mspace{14mu} {{D = {\begin{matrix} D_{11} & 0 \\ 0 & D_{22} \end{matrix}}};}$ computing D₁₁ and D₂₂ as follows: ${D_{11} = \frac{\left( {R_{11} + R_{22}} \right) + \sqrt{\left( {R_{11} + R_{22}} \right)^{2} - {4\left( {R_{11} + R_{22} - {R_{12}R_{12}^{*}}} \right)}}}{2}},\mspace{14mu} {and}$ ${D_{22} = \frac{\left( {R_{11} + R_{22}} \right) - \sqrt{\left( {R_{11} + R_{22}} \right)^{2} - {4\left( {R_{11} + R_{22} - {R_{12}R_{12}^{*}}} \right)}}}{2}};$ computing four elements of the Q matrix as follows: ${Q_{21} = \frac{\left( {D_{11} - R_{11}} \right)Q_{11}}{R_{12}}},{Q_{11} = \sqrt{\frac{R_{12}^{H}R_{12}}{{R_{12}^{H}R_{12}} + \left( {D_{11} - R_{11}} \right)^{2}}}},{Q_{22} = \frac{R_{12}^{H}Q_{12}}{D_{22} - R_{22}}}$ and ${Q_{12} = \sqrt{\frac{\left( {D_{22} - R_{22}} \right)^{2}}{{R_{12}^{H}R_{12}} + \left( {D_{22} - R_{22}} \right)^{2}}}};$ and, computing the inverse matrix as follows: R⁻¹=QD⁻¹Q^(H). 